CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver
نویسندگان
چکیده
Abstract We present a certified SMT QF_BV solver CoqQFBV built from verified bit blasting algorithm, Kissat , and the SAT certificate checker GratChk in this paper. Our algorithm supports full logic of SMT-LIB ; it is specified formally proof assistant Coq . compare with CVC4 Bitwuzla Boolector on benchmarks division single query track 2020 Competition, real-world cryptographic program verification problems. surprisingly solves more problems certification than winner without certification.
منابع مشابه
Beaver: An SMT Solver for Quantifier-free Bit-vector Logic
This thesis presents Beaver – an efficient SMT solver for the quantifier-free fixed-size bit-vector logic (QF BV). Beaver is an eager solver, that is, given an SMT formula, it first performs word-level simplications and then bitblasts the simplified formula to a Boolean formula, which is then solved using any SAT solver. Several engineering techniques are behind its efficiency: 1) efficient con...
متن کاملBeaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifierfree finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, encoding the original SMT problem into a Boolean satisfiability (SAT) problem using a series of word-level and bit-level transformations. In this paper, we describe the most effective transformations, such as propagating ...
متن کاملbv2epr: A Tool for Polynomially Translating Quantifier-free Bit-Vector Formulas into EPR∗
Bit-precise reasoning is essential in many applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. Most of these approaches rely on bit-blasting. In [1], we argued that bit-blasting is not polynomial in general, and then showed that solving quantifier-free bit-vector formulas (QF BV) is NExpTime-...
متن کاملBoolector: An Efficient SMT Solver for Bit-Vectors and Arrays
Satisfiability Modulo Theories (SMT) is the problem of deciding satisfiability of a logical formula, expressed in a combination of first-order theories. We present the architecture and selected features of Boolector, which is an efficient SMT solver for the quantifier-free theories of bit-vectors and arrays. It uses term rewriting, bit-blasting to handle bit-vectors, and lemmas on demand for ar...
متن کاملMore on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Most of these results only hold if unary encoding on the bit-wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-81688-9_7